A Formalizing Negotiations Using Logic Programming
نویسندگان
چکیده
The paper introduces a logical framework for negotiation among dishonest agents. The framework relies on the use of abductive logic programming as a knowledge representation language for agents to deal with incomplete information and preferences. The paper shows how intentionally false or inaccurate information of agents can be encoded in the agents’ knowledge bases. Such disinformation can be effectively used in the process of negotiation to have desired outcomes by agents. The negotiation processes are formulated under the answer set semantics of abductive logic programming, and they enable the exploration of various strategies that agents can employ in their negotiation. A preliminary implementation has been developed using the ASP-Prolog platform.
منابع مشابه
Logic Programming for Multiagent Planning with Negotiation
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their goals. One way for the agents to interact is through negotiations. Integration of negotiation in multiagent planning has not been extensively investigated and a systematic way for this task has yet to be found. We de...
متن کاملProceedings of the 10 th International Workshop on Computational Logic in Multi - Agent Systems 2009
Multiagent planning deals with the problem of generatingplans for multiple agents. It requires formalizing ways for the agents tointeract and cooperate, in order to achieve their goals. We will discuss twopossible ways for agents to interact: the execution of cooperative actionsand negotiations. We begin with the introduction of an action languagefor specifying multiagent pl...
متن کاملFrom Functional Speciications to Logic Programs
The paper investigates a methodology for representing knowledge in logic programming using functional speciications. The methodology is illustrated by an example formalizing several forms of inheritance reasoning. We also introduce and study a new speciication constructor which corresponds to removal of the closed world assumption from input predicates of functional speciications.
متن کاملFormalizing a Switch of Burden of Proof by Logic Programming
Prakken [2] argues that we cannot formalize a switch of burden of proof in legal reasoning either by argumentation framework or by nonmonotonic reasoning since argumentation semantics can represent any nonmonotonic formalism. In this paper, we argue that a switch of burden of proof can be formalized in nonmonotonic reasoning by formalizing burden of proof in a different way followed by the Japa...
متن کاملFrom Functional Speci cations toLogic
The paper investigates a methodology for representing knowledge in logic programming using functional speciications. The methodology is illustrated by an example formalizing several forms of inheritance reasoning. We also introduce and study a new speciication constructor which corresponds to removal of the closed world assumption from input predicates of functional speciications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013